Robust Estimation of Point Process Intensity Features using k - minimal Spanning Trees 1
نویسنده
چکیده
Minimal spanning trees (MST) have been applied to multi-dimensional random processes for pattern recognition and randomness testing (See [l] for references). In this paper we present a robust version of the MST to estimate complexity features of a point process intensity function under an epsilon contaminated model for the intensity. The principal feature considered is the Renyi entropy of the mixture and a strongly consistent entropy estimator is given which depends on the data only through the total length of the MST passing through the data points. Robustification of the MST estimator is achieved by applying the theory of k-minimum MST’s [Z]. I. RENYI FEATURES AND FRACTIONAL MOMENTS Let d N ( z ) , 2: E X, be a multi-dimensional Poisson point process having normalized multivariate intensity A(z) which is the mixture: X(z) = (1 e)X,(z) + cA,(z), 0 5 t < 1. We assume that the “noise component” A, is a uniform intensity and e is unknown. A spanning tree is a connected acyclic graph which passes through all coordinates associated with the point cloud generated by the process. It consists of an ordered list of normalized edge lengths along with a list of edge adjacency relations. The total length of the tree is defined as the sum of all edge lengths. The minimal spanning tree (MST) is the spanning tree which posesses minimal total length. The kminimum spanning tree is the minimum length MST among those that pass through any k of the n points thus the standard MST is equivalent to the n-minimum MST. The features are defined as the Renyi entropy H,(dN) of fractional orders a, 0 < a 5 1, associated with A, The Renyi entropy equals zero for a = 0 and converges to the Shannon entropy s, A, In A, as a approaches 1. For any a the Renyi entropy is maximized for a uniform intensity and minimized for an intensity concentrated a t a single point. Define the fractional moment of the edge lengths {Z,}y=-: of an MST passing through n points of an observed p dimensional point cloud
منابع مشابه
Estimation of Rényi Information Divergence via Pruned Minimal Spanning Trees
In this paper we develop robust estimators of the Rényi information divergence (I-divergence) given a reference distribution and a random sample from an unknown distribution. Estimation is performed by constructing a minimal spanning tree (MST) passing through the random sample points and applying a change of measure which flattens the reference distribution. In a mixture model where the refere...
متن کاملPoisson-Voronoi Spanning Trees with Applications to the Optimization of Communication Networks
We de ne a family of random trees in the plane. Their nodes of level k; k = 0; : : : ;m are the points of a homogeneous Poisson point process k, whereas their arcs connect nodes of level k and k + 1, according to the least distance principle: if V denotes the Voronoi cell w.r.t. k+1 with nucleus x, where x is a point of k+1, then there is an arc connecting x to all the points of k which belong ...
متن کاملOn A Random Directed Spanning Tree
We study the asymptotic properties of a minimal spanning tree formed by n points uniformly distributed in the unit square, where the minimality is amongst all rooted spanning trees with a direction of growth. We show that the number of branches from the root of this tree, the total length of these branches, and the length of the longest branch each converge weakly. This model is related to the ...
متن کاملA robust wavelet based profile monitoring and change point detection using S-estimator and clustering
Some quality characteristics are well defined when treated as response variables and are related to some independent variables. This relationship is called a profile. Parametric models, such as linear models, may be used to model profiles. However, in practical applications due to the complexity of many processes it is not usually possible to model a process using parametric models.In these cas...
متن کاملDetection of some Tree Species from Terrestrial Laser Scanner Point Cloud Data Using Support-vector Machine and Nearest Neighborhood Algorithms
acquisition field reference data using conventional methods due to limited and time-consuming data from a single tree in recent years, to generate reference data for forest studies using terrestrial laser scanner data, aerial laser scanner data, radar and Optics has become commonplace, and complete, accurate 3D data from a single tree or reference trees can be recorded. The detection and identi...
متن کامل